Confidential Greedy Graph Algorithm
نویسندگان
چکیده
Confidential algorithm for the approximate graph vertex covering problem is presented in this article. It can preserve privacy of data at every stage computation, which very important context cloud computing. Security of~our solution based on fully homomorphic encryption scheme. The time complexity and security aspects considered are described.
منابع مشابه
A GPU Algorithm for Greedy Graph Matching
Greedy graph matching provides us with a fast way to coarsen a graph during graph partitioning. Direct algorithms on the CPU which perform such greedy matchings are simple and fast, but offer few handholds for parallelisation. To remedy this, we introduce a fine-grained shared-memory parallel algorithm for maximal greedy matching, together with an implementation on the GPU, which is faster (spe...
متن کاملA Greedy Algorithm to Construct L1 Graph with Ranked Dictionary
L1 graph is an effective way to represent data samples in many graph-oriented machine learning applications. Its original construction algorithm is nonparametric, and the graphs it generates may have high sparsity. Meanwhile, the construction algorithm also requires many iterative convex optimization calculations and is very time-consuming. Such characteristics would severely limit the applicat...
متن کاملA Simple Greedy Algorithm for Dynamic Graph Orientation
Graph orientations with low out-degree are one of several ways to efficiently store sparse graphs. If the graphs allow for insertion and deletion of edges, one may have to flip the orientation of some edges to prevent blowing up the maximum out-degree. We use arboricity as our sparsity measure. With an immensely simple greedy algorithm, we get parametrized trade-off bounds between outdegree and...
متن کاملObscuring Provenance Confidential Information via Graph Transformation
Provenance is a record that describes the people, institutions, entities, and activities involved in producing, influencing, or delivering a piece of data or a thing. In particular, the provenance of information is crucial in deciding whether information is to be trusted. PROV is a recent W3C specification for sharing provenance over the Web. However, provenance records may expose confidential ...
متن کاملSuccinct Greedy Graph Drawing in R
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. We show that greedy graph drawing schemes exist for the Euclidean metric in R, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(log n) bits. Moreover...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronics and Telecommunications
سال: 2023
ISSN: ['2300-1933', '2081-8491']
DOI: https://doi.org/10.24425/119367